Maximal set

Results: 92



#Item
51BRICS  Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph  On the Number of Maximal Independent Sets

BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2002-04-12 04:11:55
52

PDF Document

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-04-17 12:02:13
53On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§

On Chromatic Sums and Distributed Resource Allocation Amotz Bar-Noy∗ Mihir Bellare† Hadas Shachnai§

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-04-15 10:45:37
54Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set

Add to Reading List

Source URL: www.net.t-labs.tu-berlin.de

Language: English - Date: 2011-06-28 01:58:12
5570  CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult

70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
56Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:46
57Chapter 7  Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di

Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
58Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers†  Mathieu Liedloff§

Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2009-10-29 15:21:24
59CCCG 2010, Winnipeg MB, August 9–11, 2010  Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:18
60

PDF Document

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:49